Semantics of Constraint Logic Programs with Bounded Quantifiers
نویسندگان
چکیده
We survey the areas of Constraint programming, Bounded Quanti ers and Collection Types, then we describe an extension of constraint logic programming by bounded quanti ers. Bounded quanti ers provide the support for nite domain constraint programming in a natural way. We de ne several semantics for constraint logic programs with bounded quanti ers and prove their equivalence. Our results can be used to de ne semantics for some existing constraint logic programming languages, like cc(FD).
منابع مشابه
Two New Definitions of Stable Models of Logic Programs with Generalized Quantifiers
We present alternative definitions of the first-order stable model semantics and its extension to incorporate generalized quantifiers by referring to the familiar notion of a reduct instead of referring to the SM operator in the original definitions. Also, we extend the FLP stable model semantics to allow generalized quantifiers by referring to an operator that is similar to the SM operator. Fo...
متن کاملAutomatic software model checking via constraint logic
This paper proposes the use of constraint logic to perform model checking of imperative, infinite-state programs. We present a semantics-preserving translation from an imperative language with recursive procedures and heap-allocated mutable data structures into constraint logic. The constraint logic formulation provides a clean way to reason about the behavior and correctness of the original pr...
متن کاملRelating weight constraint and aggregate programs: Semantics and representation
Weight constraint and aggregate programs are among the most widely used logic programs with constraints. In this paper, we relate the semantics of these two classes of programs, namely the stable model semantics for weight constraint programs and the answer set semantics based on conditional satisfaction for aggregate programs. Both classes of programs are instances of logic programs with const...
متن کاملStable Generated Models of Generalized Constraint Logic Programs
We present a declarative semantics of generalized constraint logic programs based on stable generated models. Generalized logic programs contain arbitrary quantiier free formulas in the bodies and heads of their rules. Up to now the only declarative semantics for this program class is deened in terms of stable generated models introduced by Herre and Wagner. A generalized constraint logic progr...
متن کاملA Well-Founded Semantics for Basic Logic Programs with Arbitrary Abstract Constraint Atoms
Logic programs with abstract constraint atoms proposed by Marek and Truszczynski are very general logic programs. They are general enough to capture aggregate logic programs as well as recently proposed description logic programs. In this paper, we propose a wellfounded semantics for basic logic programs with arbitrary abstract constraint atoms, which are sets of rules whose heads have exactly ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996